منابع مشابه
Full abstraction, totality and PCF
Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, asking whether full abstraction holds for Scott’s model of cpos and continuous functions if one restricts to total programs and total observations. The answer is negative, as there are distinct operational and denotational notions of totality. However, when two terms are each total in both senses the...
متن کاملFull Abstraction for PCF
An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain “history-free” strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable in a certain simple extension of PCF. We then introduce an intrinsic preorder on strategies, and show that i...
متن کاملLogical Full Abstraction and PCF
We introduce the concept of logical full abstraction, generalising the usual equational notion. We consider the language PCF and two extensions with “parallel” operations. The main result is that, for standard interpretations, logical full abstraction is equivalent to equational full abstraction together with universality; the proof involves constructing enumeration operators. We also consider ...
متن کاملFull abstraction for probabilistic PCF
We present a probabilistic version of PCF, a well-known simply typed universal functional language. The type hierarchy is based on a single ground type of natural numbers. Even if the language is globally call-byname, we allow a call-by-value evaluation for ground type arguments in order to provide the language with a suitable algorithmic expressiveness. We describe a denotational semantics bas...
متن کاملFull abstraction for a Linear PCF
We study S PCF , namely a Turing-complete programming language inspired by a semantic notion of linearity. S PCF is based on a linear core of PCF and some operators providing basic primitives related to exception handling and nondeterministic evaluation. We show that S PCF is fully abstract for a linear model in the category of coherence spaces and linear functions, giving a cogent evidence of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 1999
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129598002692